If the access time of a symbol table can be made logarithmic, it greatly reduces the search time. This can be implemented by
The following graph is reduced to its minimum spanning tree using prim's method. Indicate the sequence in which the nodes get included
Given the set of keys ( 40, 80, 35, 90, 45, 50, 70 ), which of the following represents a heap ? ( Each pair of parentheses indicate nodes at one level, left child first)
A hash table contains 10 buckets and uses linear probing to avoid collisions. The key values are integers and hash function used is key mod 10. If the values come as 43. 165. 62, 123 and 142. in what location is 142 inserted ?
